Conference Proceedings

Sampling Without Compromising Accuracy in Adaptive Data Analysis

Benjamin Fish, Lev Reyzin, Benjamin Rubinstein, Aryeh Kontorovich (ed.), Gergely Neu (ed.)

Proceedings of the 31st International Conference on Algorithmic Learning Theory | PMLR | Published : 2020

Abstract

In this work, we study how to use sampling to speed up mechanisms for answering adaptive queries into datasets without reducing the accuracy of those mechanisms. This is important to do when both the datasets and the number of queries asked are very large. In particular, we describe a mechanism that provides a polynomial speed-up per query over previous mechanisms, without needing to increase the total amount of data required to maintain the same generalization error as before. We prove that this speed-up holds for arbitrary statistical queries. We also provide an even faster method for achieving statistically-meaningful responses wherein the mechanism is only allowed to see a constant numbe..

View full abstract

University of Melbourne Researchers

Grants

Awarded by National Science Foundation


Funding Acknowledgements

Benjamin Fish was supported in part by the NSF EAPSI fellowship and NSF grant IIS-1526379. Lev Reyzin was supported in part by NSF grants IIS-1526379 and CCF-1848966. Benjamin Rubinstein acknowledges support of the Australian Research Council (DP150103710).